| class DIGRAPH_INC_SET_VIEW{NTP,GTP<$DIGRAPH{NTP}} < $RO_SET{NTP} |
|---|
| **** | View of the incoming edges into the node of a digraph. |
| $RO_SET{_} | $STR | $CONTAINER{_} | $ELT{_} | $ELT | RO_SET_INCL{_} | COMPARE{_} |
| copy: SAME |
|---|
| **** | Return a copy of self |
| create(g: GTP,dest: NTP): SAME |
|---|
| **** | Create a view of the set of incoming nodes to "dest" in the graph "g" |
| has(n: NTP): BOOL |
|---|
| **** | Return true if node "dest" has an incoming edge from "n" |
| size: INT |
|---|
| **** | Return the number of incoming edges into "dest" |
| elt!: NTP |
|---|
| **** | Yield the nodes which have edges to "dest" |
| attr dest: NTP; |
|---|
| **** | The node whose incoming edges are being viewed |
| attr dest: NTP; |
|---|
| **** | The node whose incoming edges are being viewed |
| attr graph: GTP; |
|---|
| **** | A pointer to the original graph being viewed |
| attr graph: GTP; |
|---|
| **** | A pointer to the original graph being viewed |